Performance of correlated queues: the impact of correlated service and inter-arrival times

نویسندگان

  • Gang Uk Hwang
  • Khosrow Sohraby
چکیده

In this paper, we consider correlated queues where the service time of a packet is strongly correlated with its inter-arrival time due to the finite transmission capacity of input and output links. We present an analytical method to derive the LST (Laplace Stieltjes Transform) of the (actual) waiting time distribution and the system time distribution. To investigate the impact of such correlation between service and inter-arrival times on the system performance, we consider a counterpart GI/G/1 queue where the service time and inter-arrival time distributions are the same as in our correlated system, but they are independent. Some numerical examples are provided to show that such correlation gives significant impact on the system performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.

This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt

متن کامل

The Effect of Correlated Service and Inter-arrival Times on System Performance

In communication networks where communication nodes are connected with finite capacity transmission links, the packet inter-arrival times are strongly correlated with the packet length and the link capacity (or the packet service time). Such correlation affects the system performance significantly, but little attention has been paid to this issue. In this paper, we propose a mathematical framew...

متن کامل

A matrix geometric representation for the queue length distribution of multitype semi-Markovian queues

In this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times. Queues belonging to this class are characterized by a set of matrices of size m and Sengupta showed that its waiting time distribution can be represe...

متن کامل

Queues with correlated service and inter-arrival times and its application to optical buffers

This paper presents an algorithmic procedure to calculate the queue length and delay distribution of customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on the inter-arrival time between himself and his predecessor. Setting up a Markov chain that keeps track of the contents of such a queue will result in a state space explosion as the inter-a...

متن کامل

Strong Approximations

In real stochastic systems, the arrival and service processes may not be renewal processes. For example, in many telecommunication systems such as internet traffic where data traffic is bursty, the sequence of inter-arrival times and service times are often correlated and dependent. One way to model this non-renewal behavior is to use Markovian Arrival Processes (MAP’s) and Markovian Service Pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Perform. Eval.

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2004